Semi-algebraic Complexity—Additive Complexity of Matrix Computational Tasks
نویسندگان
چکیده
منابع مشابه
Complexity of Semi-algebraic Proofs
It is a known approach to translate propositional formulas into systems of polynomial inequalities and consider proof systems for the latter. The well-studied proof systems of this type are the Cutting Plane proof system (CP) utilizing linear inequalities and the Lovász– Schrijver calculi (LS) utilizing quadratic inequalities. We introduce generalizations LS of LS that operate on polynomial ine...
متن کاملComputational Complexity of Solving Real Algebraic Formulae
where e e IR", b e IR" and A is an m x n matrix. In the last four years there has been a vast amount of work on "interior point" algorithms, motivated by Karmarkar's algorithm [16]. Unlike the traditional simplex method which moves from vertex to vertex around the feasible region {x;>4x > b}, interior point methods proceed through the interior {x;Ax > b] of the feasible region. Karmarkar's algo...
متن کاملAn Algebraic Approach to Computational Complexity
The theory of computational complexity is concerned with identifying methods for computing solutions to problems in a minimal number of steps. Despite the diversity of application areas from which such problems can be drawn this theory has been successful in identifying a small number of fundamental questions on which a sizable fraction of the field hangs. A prime example is the P = ?ÎTP questi...
متن کاملAlgebraic Methods in Computational Complexity Dagstuhl Seminar
From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 Algebraic Methods in Computational Complexity was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are ...
متن کاملAlgebraic and Combinatorial Methods in Computational Complexity 1 Executive Summary 64 12421 – Algebraic and Combinatorial Methods in Computational Complexity
At its core, much of Computational Complexity is concerned with combinatorial objects and structures. But it has often proven true that the best way to prove things about these combinatorial objects is by establishing a connection (perhaps approximate) to a more well-behaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1997
ISSN: 0885-064X
DOI: 10.1006/jcom.1997.0430